Path-set induced closure operators on graphs
نویسندگان
چکیده
منابع مشابه
M-FUZZIFYING MATROIDS INDUCED BY M-FUZZIFYING CLOSURE OPERATORS
In this paper, the notion of closure operators of matroids is generalized to fuzzy setting which is called $M$-fuzzifying closure operators, and some properties of $M$-fuzzifying closure operators are discussed. The $M$-fuzzifying matroid induced by an $M$-fuzzifying closure operator can induce an $M$-fuzzifying closure operator. Finally, the characterizations of $M$-fuzzifying acyclic matroi...
متن کاملClosure Operators in Fuzzy Set Theory
In accordance with Tarski point of view, in this chapter the theory of closure operators is proposed as a unifying tool for fuzzy logics. Indeed, let F be the set of formulas of a given language. Then an abstract fuzzy logic is defined by a fuzzy semantics (i.e. a class of valuations of the formulas in F) and by a closure operator in the lattice of the fuzzy subsets of F (we call deduction oper...
متن کاملFuzzy Forcing Set on Fuzzy Graphs
The investigation of impact of fuzzy sets on zero forcing set is the main aim of this paper. According to this, results lead us to a new concept which we introduce it as Fuzzy Zero Forcing Set (FZFS). We propose this concept and suggest a polynomial time algorithm to construct FZFS. Further more we compute the propagation time of FZFS on fuzzy graphs. This concept can be more efficient to model...
متن کاملFuzzy Closure Operators Induced by Similarity
In fuzzy set theory, similarity phenomenon is approached using so-called fuzzy equivalence relations. An important role in fuzzy modeling is played by similarity-based closure (called also the extensional hull). Intuitively, the degree to which an element x belongs to a similarity-based closure of a fuzzy set A is the degree to which it is true that there is an element y in A which is similar t...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2016
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1603863s